Performance guarantees and applications for Xia's algorithm
نویسندگان
چکیده
Xia’s algorithm consists of a reduction algorithm and a translation procedure both originally used to tackle the xed point property for ordered sets. We present results that show that the translation procedure allows access to a much wider range of problems and results showing that the algorithm is very e cient when applied to the xed point property in ordered sets or for order=graph isomorphism=rigidity. c © 2000 Published by Elsevier Science B.V. All rights reserved. MSC: 06A06; 05C85; 05C99; 68Q15; 68Q25
منابع مشابه
Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملOn Xia's Construction of Hadamard Di erence Sets
In this paper, we present a new way of viewing Xia's construction of Hadamard diierence sets. Based on this new point of view, we give a character theoretic proof for Xia's construction. Also we point out a connection between the construction and projective three-weight codes.
متن کاملUsing a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملEfficient Scheduling of Real-Time Multi-Task Applications in Dynamic Systems
The Bandwidth Sharing Server (BSS) is a scheduling strategy for multi-task real-time applications that provides the dual properties of performance guarantees and inter-application isolation. We describe here the BSS-I algorithm, an evolution of the BSS, aimed at (i) improving the run-time performance and (ii) generalizing the kinds of performance guarantees that can be o ered.
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 213 شماره
صفحات -
تاریخ انتشار 2000